Distributed Enumeration

An Implementation Framework for HPF Distributed Arrays on Message-Passing Parallel Computer Systems

Data parallel languages, like High Performance Fortran (HPF), support the notion of distributed arrays. However, the implementation of such distributed array structures and their access on message passing computers is not straightforward. This holds especially for distributed arrays that are aligned to each other and given a block-cyclic distribution. In this paper, an implementation framework ...

A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter

We consider the standard message passing model; we assume the system is fully synchronous: all processes start at the same time and time proceeds in synchronised rounds. In each round each vertex can transmit a different message of size O(1) to each of its neighbours. This paper proposes and analyses a distributed enumeration algorithm of vertices of a graph having a distinguished vertex which ...

Debugging of Distributed Computations via Memory-E ient Enumeration of Global States

Techniques for Distributed Reachability Analysis with Partial Order and Symmetry based Reductions

In this work we propose techniques for efficient reachability analysis of the state space (e.g., detection of bad states) using a combination of partial order and symmetry based reductions in a distributed setting. The proposed techniques are focused towards explicit state space enumeration based model-checkers like SPIN. We consider variants for both depth-first as well as breadth-first based ...

How many can you see at a glance? The role of attention in visual enumeration

There is considerable controversy as to how the brain extracts numerosity information from a visual scene and as to how much attention is needed for this process. Traditionally, it has been assumed that visual enumeration is subserved by two functionally distinct mechanisms: the fast and accurate apprehension of 1 to about 4 items, a process termed “subitizing”, and the slow and error-prone enu...

Debugging of Distributed Computation via Memory-Efficient Enumeration of Global States

We develop a memory-e cient o -line algorithm for the enumeration of global states of a distributed computation. The algorithm allows the parameterization of its memory requirements against the running time. In the extreme case, only one global state of a distributed computation must be held in the memory of the enumerating system at a time. This is particularly useful for debugging of memoryin...